A filter algorithm with inexact line search is proposed for solving nonlinear programming problems.\r\nThe filter is constructed by employing the normof the gradient of the Lagrangian function to\r\nthe infeasibility measure. Transition to superlinear local convergence is showed for the proposed\r\nfilter algorithm without second-order correction. Under mild conditions, the global convergence\r\ncan also be derived. Numerical experiments show the efficiency of the algorithm.
Loading....